Optimal transportation for a quadratic cost with convex constraints and applications
نویسندگان
چکیده
منابع مشابه
Optimal transportation for a quadratic cost with convex constraints and applications
We prove existence of an optimal transport map in the MongeKantorovich problem associated to a cost c(x, y) which is not finite everywhere, but coincides with |x− y|2 if the displacement y − x belongs to a given convex set C and it is +∞ otherwise. The result is proven for C satisfying some technical assumptions allowing any convex body in R2 and any convex polyhedron in R, d > 2. The tools are...
متن کاملMINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL
In the context of a variation of the standard UFL (Uncapacitated Facility Location) problem, but with an objective function that is a separable convex quadratic function of the transportation costs, we present some techniques for improving relaxations of MINLP formulations. We use a disaggregation principal and a strategy of developing model-specific valid inequalities (some nonlinear), which e...
متن کاملThe Decomposition of Optimal Transportation Problems with Convex Cost
Given a positive l.s.c. convex function c : Rd → R and an optimal transference plane π for the transportation problem ∫ c(x′ − x)π(dxdx′), we show how the results of [6] on the existence of a Sudakov decomposition for norm cost c = | · | can be extended to this case. More precisely, we prove that there exists a partition of Rd into a family of disjoint sets {Sh a }h,a together with the projecti...
متن کاملAn optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
We propose a modification of our MPGP algorithm for the solution of bound constrained quadratic programming problems so that it can be used for minimization of a strictly convex quadratic function subject to separable convex constraints. Our active set based algorithm explores the faces by conjugate gradients and changes the active sets and active variables by gradient projections, possibly wit...
متن کاملOptimal Transportation with Capacity Constraints
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function. Here we consider a natural but largely unexplored variant of this problem by imposing a pointwise constraint on the joint (absolutely continuous) measures: ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Mathématiques Pures et Appliquées
سال: 2012
ISSN: 0021-7824
DOI: 10.1016/j.matpur.2012.01.002